A connectionist model of planning via back-chaining search

نویسندگان

  • Max Garagnani
  • Lokendra Shastri
چکیده

Great advances have marked the progress of AI planning research over the past few years. Recent systems can quickly solve problems that are orders of magnitude harder than those tackled by the best previous planners. However, we are still a long way from understanding how humans plan. Understanding how humans plan is important if we are to develop intelligent planning systems capable of dealing with complex real world problems involving uncertainty, incomplete knowledge, limited resources, non-deterministic actions and probabilistic effects. In this paper we propose a neurally plausible model of cognitive planning that exhibits a state-space search behavior. The system is based primarily on two cognitive functionalities, namely, episodic memory and perception. In spite of its simple structure, the model can search for and execute plans involving an arbitrary number of steps. The model demonstrates how general purpose cognitive faculties such as episodic memory, semantic memory and perception can be harnessed to solve a restricted subclass of planning problems. Although the schema discussed in this paper is limited in a number of ways, we discuss how it can be extended into a more powerful and expressive planning system by incorporating additional control and memory structures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Control Strategies in Planning

Over the years increasing sophisticated planning algorithms have been developed. These have made for more efficient planners. However, current state of the art planners still suffer from severe complexity problems, problems that can surface even in domains in which good plans are easy to generate, like the blocks world. Planners generally employ search to find plans, and planning research has i...

متن کامل

Making Forward Chaining Relevant

Planning by forward chaining through the world space has long been dismissed as being “obviously” infeasible. Nevertheless, this approach to planning has many advantages. Most importantly forward chaining planners maintain complete descriptions of the intermediate states that arise during the course of the plan’s execution. These states can be utilized to provide highly effective search control...

متن کامل

Mixed-Initiative Goal Manipulation

62 AI MAGAZINE ■ Mixed-initiative planning systems attempt to integrate human and AI planners so that the synthesis results in high-quality plans. In the AI community, the dominant model of planning is search. In state-space planning, search consists of backward and forward chaining through the effects and preconditions of operator representations. Although search is an acceptable mechanism to ...

متن کامل

Optimal Planning with a Goal-directed Utility Model

Classical AI planning adopts a very narrow notion of plan quality, namely that a plan is good just in case it achieves a speci ed goal. Despite the fact that planning is intractable in the worst case, goal-satisfying planning algorithms can e ectively solve classes of problems by using the goal to focus the search for a solution (by using backward-chaining techniques), and by exploiting domain-...

متن کامل

Planning as Mixed-Initiative Goal Manipulation

Mixed-initiative planning systems attempt to integrate human and AI planners so that the synthesis results in high quality plans. In the AI community, the dominant model of planning is search. In state-space planning, search consists of backward and forward chaining through the effects and preconditions of operator representations. Although search is an acceptable mechanism to use in performing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001